- b樹(shù)索引系統(tǒng)
下載手機(jī)詞典可隨時(shí)隨地查詞查翻譯
b-tree indexing中文什么意思
例句與用法
- Hbt lock on a heap or b - tree index
Hbt =堆或b樹(shù)索引的鎖。 - Nonclustered indexes have a b - tree index structure similar to the one in clustered indexes
非聚集索引與聚集索引有一個(gè)相似的b樹(shù)索引結(jié)構(gòu)。 - All internal data structures , such as b - tree indexes or doubly - linked lists , must be correct at the end of the transaction
事務(wù)結(jié)束時(shí)，所有的內(nèi)部數(shù)據(jù)結(jié)構(gòu)（如b樹(shù)索引或雙向鏈表）都必須是正確的。 - The clustered index is implemented as a b - tree index structure that supports fast retrieval of the rows , based on their clustered index key values
聚集索引按b樹(shù)索引結(jié)構(gòu)實(shí)現(xiàn)， b樹(shù)索引結(jié)構(gòu)支持基于聚集索引鍵值對(duì)行進(jìn)行快速檢索。 - These algorithms lead to optimal join performance : nodes that do not participate in the join can be judged beforehand and then skipped using b - tree index . besides , each element list joined is scanned sequentially once at most . furthermore , output of join results is sorted in document order
其次，提出了兩個(gè)高效的兄弟關(guān)系的結(jié)構(gòu)連接算法，這兩個(gè)算法具有較好的連接性能：不參與連接的結(jié)點(diǎn)可以事先判斷出來(lái)并利用b樹(shù)跳過(guò)，連接的兩個(gè)列表最多都只需掃描一次，而且連結(jié)結(jié)果按照文檔序有序。